An Extension of Moore's Result for Closed Queuing Networks

نویسنده

  • Simon S. Lam
چکیده

In this communication, Moore's result for the normalization constant of a closed queuing network of exponential servers is extended to the case of nondistinct traffic intensities. We then show that this result can be applied to various more general closed and semiclosed queuing networks with a product-form solution. Introduction Substantial progress has been made recently in extending the scope of Jackson's product-form solution for queuing networks [ 1 51. At the same time, a number of very efficient computational algorithms [ 3, 681 have been developed for evaluating the normalization constant and marginal queue length statistics for such networks. These algorithms are all based upon some recursive scheme. For the special case of a closed network of exponential servers with distinct traffic intensities, Moore has shown an explicit solution for the normalization constant using the partial fraction method [9]. In this note, we extend Moore's result to the case of nondistinct traffic intensities and show that it can be applied to various more general closed and semiclosed queuing networks with the product-form solution. We note, however, that the partial fraction method is less versatile than recursive techniques. I t also requires the summation of terms with alternating signs, and thus may be subject to round-off errors in some cases [ 31. Assumptions We outline here the scope of queuing networks for which the results in this communication are applicable. Consider a queuing network with M , service stations and R classes of customers. (See [ 21 .) At the completion of a service request, a customer may change its class membership and proceed to another service station (or leave the network) according to fixed transition probabilities. Four types of service stations may be considered: 1 ) a single server, first-come-first-served service discipline (FCFS) ; 2 ) a single server, processor-sharing service discipline (PS) ; 3) a single server, last-come-first-served preemptive-resume service discipline (LCFS) ; and 4) no queuing, arbitrarily many servers (IS). In an FCFS ser384 vice station, all customers have the same negative S. S. LAM exponential service time distribution with a fixed service rate. In PS, LCFS, or IS service stations, each class of customers may have its own general service time distribution which has a rational Laplace transform. Let ni, 1 5 i 5 M,, denote the number of customers at service station i. We assume that the underlying Markov chain of customer transitions is irreducible. The arrival process of customers to the network is a Poisson process with an arrival rate dependent on the instantaneous number n' of customers in the network at time t . Moreover, if n' = N,, a departing customer is immediately replaced; if nt = N,, all arrivals are lost. Thus, n' is constrained: N, 5 n' 5 N,. In particular, for a closed queuing network N, = N,. Below, we first present our results for closed queuing networks and then indicate how to extend these results to the more general case of semiclosed networks (N, < N,) [7]. Results for closed queuing networks Let there be M service stations of types FCFS, PS, and LCFS labeled by { 1, 2 , . . ., M } , and M , M service stations of type IS labeled by { M + 1 , . . ., M s } . Suppose pir, 1 5 i 5 M , and 1 5 Y 5 R , are the relative traffic intensities [3] of class r customers at service station i . Define pi 6 2 pi,., 1 5 i 5 Ms. The equilibrium joint queue length distribution is R

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations

Closed Queueing Networks are used in modeling various systems such as FMS, CONWIP Material Control, Computer/Communication Systems, and Health Care. Mean Value Analysis (MVA) is often used to compute the performance measures for these models. For networks with multiple-server stations, the exact MVA algorithm becomes computationally complex and existing approximations introduce high errors. The...

متن کامل

Stochastic extension of cellular manufacturing systems: a queuing-based analysis

Clustering parts and machines into part families and machine cells is a major decision in the design of cellular manufacturing systems which is defined as cell formation. This paper presents a non-linear mixed integer programming model to design cellular manufacturing systems which assumes that the arrival rate of parts into cells and machine service rate are stochastic parameters and descri...

متن کامل

A Parametric Decomposition Based Approach for Multi-class Closed Queuing Networks with Synchronization Stations

Multi-class closed queuing networks with synchronization stations find applications in analytical models of assembly systems and production systems operating under pull control policies. These queuing networks are hard to analyze exactly and therefore approximation methods must be used for performance evaluation. In this research we propose a new efficient approach based on parametric decomposi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IBM Journal of Research and Development

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1977